Notes on Models of Computation and Lower Bounds
نویسنده
چکیده
The algorithms will be described using a pseudo-code that will be a mixture of English sentences and of constructs akin to those of C and Pascal. Though pseudo-code is a very informal way of describing an algorithm, it can be used so that the description is unambiguous and also so that it is apparent what is the number of elementary steps that are executed by a given algorithm on a given input. Our goal will be to show that for any given n, the running time of the algorithm for instances of size n is bounded by some slowly growing function of n. More on pseudo-code in Section 1.1 of CLR.
منابع مشابه
A Survey on Stability Measure of Networks
In this paper we discuss about tenacity and its properties in stability calculation. We indicate relationships between tenacity and connectivity, tenacity and binding number, tenacity and toughness. We also give good lower and upper bounds for tenacity.
متن کاملAre Lower Bounds Easier over the Reals ? Ecole Normale Supérieure De Lyon Are Lower Bounds Easier over the Reals ? Are Lower Bounds Easier over the Reals ?
We show that proving lower bounds in algebraic models of computa tion may not be easier than in the standard Turing machine model For instance a superpolynomial lower bound on the size of an alge braic circuit solving the real knapsack problem or on the running time of a real Turing machine would imply a separation of P from PSPACE A more general result relates parallel complexity classes in bo...
متن کاملTight Bounds for Set Disjointness in the Message Passing Model
In a multiparty message-passing model of communication, there are k players. Each player has a private input, and they communicate by sending messages to one another over private channels. While this model has been used extensively in distributed computing and in multiparty computation, lower bounds on communication complexity in this model and related models have been somewhat scarce. In recen...
متن کاملThree New Systematic Approaches for Computing Heffron-Phillips Multi-Machine Model Coefficients (RESEARCH NOTE)
This paper presents three new systematic approaches for computing coefficient matrices of the Heffron-Phillips multi-machine model (K1, …, K6). The amount of computations needed for conventional and three new approaches are compared by counting number of multiplications and divisions. The advantages of new approaches are: (1) their computation burdens are less than 73 percent of that of convent...
متن کاملRamsey Theory and lower bounds for branching programs
A novel technique for obtaining lower bounds for the time versus space comp1exity of certain functions in a general input oblivious sequential model of computation is developed. This is demonstrated by studying the intrinsic complexity of the following set equality problem SE(n,m): Given a sequence x1 ,x2 ,· .• ,xn ' Yl'·· .'Yn of 2n numbers of m bits each, decide whether the sets (xl' ••• ,xnJ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999